On minimum average stretch spanning trees in polygonal 2-trees

On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees

A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges. We consider the problem of computing a minimum average stretch spanning tree in polygonal 2-trees, a super class of 2-connected outerplanar graphs. For a polygonal 2-tree on n ve...

Diploma Thesis Minimum Stretch Spanning Trees

Spanning trees have always been of great interest in various areas of computer science. The same is true for the idea of shortest paths in a graph. Minimum Stretch Spanning Trees can be described as a combination of these two concepts. On the one hand they are spanning trees, on the other hand they have a minimum stretch which means that the distances between the nodes in the spanning tree rema...

Low-Stretch Spanning Trees

Low - Stretch Spanning Trees

On Average Edge Length of Minimum Spanning Trees

This paper presents a theorem that asserts that average edge length of the minimum spanning tree of a complete graph on n+ 1 vertices is less than or equal to the average edge length of all the n+ 1 minimum spanning trees of the induced graph on n vertices. The result is also in compliance with results given by Frieze and Steele.  1999 Elsevier Science B.V. All rights reserved.